________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 20:22:35
Input Data from:  dataset119.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :10
Ex.Facilities   :3
Total budget    :20000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,0565
Average f[i]   :3150
Average g[i,j] :1933,33333333333
Total demand   :11800
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 29
> Selected Move:	2570	1	-1	9	4500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1    >new incumb.: 2570


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 33
> Selected Move:	3010	1	-1	8	9500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  1    >new incumb.: 3010


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 35
> Selected Move:	3380	1	-1	6	13500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  1    >new incumb.: 3380


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 34
> Selected Move:	3870	1	-1	7	18000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  1  1    >new incumb.: 3870


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 32
> Selected Move:	3810	3	8	4	18500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 33
> Selected Move:	3690	3	4	5	17000


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 37
> Selected Move:	3490	3	6	4	18500


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 32
> Selected Move:	3620	3	5	8	19500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 30
> Selected Move:	3620	3	7	6	19000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 30
> Selected Move:	3590	3	9	7	19000


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 33
> Selected Move:	3460	3	8	5	18000


> New Y[]: 
	
	 2  3  4  0  1  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 33
> Selected Move:	3490	3	7	9	18000


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 29
> Selected Move:	3440	3	5	3	18000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 32
> Selected Move:	3500	3	4	8	17500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 30
> Selected Move:	3430	3	8	7	17000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 30
> Selected Move:	3430	2	3	-1	13000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 35
> Selected Move:	3380	3	6	8	14000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 34
> Selected Move:	3380	1	-1	3	18000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 30
> Selected Move:	3380	3	3	5	18000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 31
> Selected Move:	3380	3	7	6	17500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 31
> Selected Move:	3350	3	9	7	17500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 34
> Selected Move:	3350	3	5	3	17500


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 32
> Selected Move:	3390	3	2	9	19500


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  1  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 22
> Selected Move:	3390	4	9	3	19500


> New Y[]: 
	
	 2  3  0  4  0  0  1  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 20
> Selected Move:	3390	4	3	7	19500


> New Y[]: 
	
	 2  3  0  1  0  0  1  4  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 20
> Selected Move:	3390	4	7	8	19400


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 23
> Selected Move:	3330	3	8	4	19100


> New Y[]: 
	
	 2  3  0  1  4  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 24
> Selected Move:	3330	4	4	3	20000


> New Y[]: 
	
	 2  3  0  4  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 20
> Selected Move:	3330	4	3	7	20000


> New Y[]: 
	
	 2  3  0  1  1  0  1  4  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 20
> Selected Move:	3330	4	7	9	20000


> New Y[]: 
	
	 2  3  0  1  1  0  1  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 24
> Selected Move:	3290	3	9	2	18000


> New Y[]: 
	
	 2  3  4  1  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 29
> Selected Move:	3320	3	6	9	18500


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 29
> Selected Move:	3320	2	3	-1	14500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 34
> Selected Move:	3320	3	7	6	14000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 33
> Selected Move:	3290	3	9	7	14000


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 33
> Selected Move:	3350	3	4	8	13500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 32
> Selected Move:	3170	3	8	5	12500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 34
> Selected Move:	3200	3	6	9	13000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 32
> Selected Move:	3200	3	7	6	12500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 32
> Selected Move:	3320	1	-1	3	16500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 31
> Selected Move:	3360	1	-1	7	21000


> New Y[]: 
	
	 2  3  4  1  0  1  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 28
> Selected Move:	3220	3	3	8	22000


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 23
> Selected Move:	3230	3	5	3	22000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 17
> Selected Move:	3310	4	0	3	19600


> New Y[]: 
	
	 0  3  4  2  0  0  1  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 21
> Selected Move:	3310	4	3	6	19800


> New Y[]: 
	
	 0  3  4  1  0  0  2  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 20
> Selected Move:	3310	4	6	7	19000


> New Y[]: 
	
	 0  3  4  1  0  0  1  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 21
> Selected Move:	3310	4	7	8	18700


> New Y[]: 
	
	 0  3  4  1  0  0  1  1  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 20
> Selected Move:	3310	4	8	9	19300


> New Y[]: 
	
	 0  3  4  1  0  0  1  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 22
> Selected Move:	3250	3	8	4	19800


> New Y[]: 
	
	 0  3  4  1  1  0  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 21
> Selected Move:	3250	4	9	4	19300


> New Y[]: 
	
	 0  3  4  1  2  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 21
> Selected Move:	3250	4	4	7	19500


> New Y[]: 
	
	 0  3  4  1  1  0  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 21
> Selected Move:	3223	4	7	3	20100


> New Y[]: 
	
	 0  3  4  2  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 18
> Selected Move:	3206	3	3	8	20200


> New Y[]: 
	
	 0  3  4  0  1  0  1  1  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 23
> Selected Move:	3181	4	8	4	20300


> New Y[]: 
	
	 0  3  4  0  2  0  1  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 22
> Selected Move:	3130	4	4	7	20500


> New Y[]: 
	
	 0  3  4  0  1  0  1  2  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 22
> Selected Move:	3130	3	8	5	19500


> New Y[]: 
	
	 0  3  4  0  1  1  1  2  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 23
> Selected Move:	3130	4	7	4	19300


> New Y[]: 
	
	 0  3  4  0  2  1  1  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 21
> Selected Move:	3130	4	4	9	19800


> New Y[]: 
	
	 0  3  4  0  1  1  1  1  0  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 22
> Selected Move:	3130	3	4	3	18300


> New Y[]: 
	
	 0  3  4  1  0  1  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 23
> Selected Move:	3170	3	9	0	16500


> New Y[]: 
	
	 2  3  4  1  0  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 31
> Selected Move:	3210	3	2	9	18500


> New Y[]: 
	
	 2  3  0  1  0  1  1  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 24
> Selected Move:	3210	4	9	3	18500


> New Y[]: 
	
	 2  3  0  4  0  1  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 62 #######################


> Neighbours evaluated; 22
> Selected Move:	3210	4	3	5	19500


> New Y[]: 
	
	 2  3  0  1  0  4  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 63 #######################


> Neighbours evaluated; 21
> Selected Move:	3210	4	5	6	19300


> New Y[]: 
	
	 2  3  0  1  0  1  4  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 64 #######################


> Neighbours evaluated; 21
> Selected Move:	3327	3	5	8	20300


> New Y[]: 
	
	 2  3  0  1  0  0  4  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 65 #######################


> Neighbours evaluated; 23
> Selected Move:	3166	3	8	4	20800


> New Y[]: 
	
	 2  3  0  1  1  0  4  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 66 #######################


> Neighbours evaluated; 22
> Selected Move:	3070	3	7	5	20300


> New Y[]: 
	
	 2  3  0  1  1  1  4  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 67 #######################


> Neighbours evaluated; 25
> Selected Move:	3130	4	6	3	19500


> New Y[]: 
	
	 2  3  0  4  1  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 68 #######################


> Neighbours evaluated; 24
> Selected Move:	3165	3	5	8	20500


> New Y[]: 
	
	 2  3  0  4  1  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 69 #######################


> Neighbours evaluated; 22
> Selected Move:	3260	4	3	4	19600


> New Y[]: 
	
	 2  3  0  1  4  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 70 #######################


> Neighbours evaluated; 26
> Selected Move:	3242	3	3	7	20100


> New Y[]: 
	
	 2  3  0  0  4  0  1  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 71 #######################


> Neighbours evaluated; 26
> Selected Move:	3130	3	8	5	19100


> New Y[]: 
	
	 2  3  0  0  4  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 72 #######################


> Neighbours evaluated; 26
> Selected Move:	3130	4	4	7	20000


> New Y[]: 
	
	 2  3  0  0  1  1  1  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 73 #######################


> Neighbours evaluated; 24
> Selected Move:	3210	3	4	3	18500


> New Y[]: 
	
	 2  3  0  1  0  1  1  4  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 74 #######################


> Neighbours evaluated; 23
> Selected Move:	3130	3	7	4	18600


> New Y[]: 
	
	 2  3  0  1  4  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 75 #######################


> Neighbours evaluated; 23
> Selected Move:	3130	4	4	9	19500


> New Y[]: 
	
	 2  3  0  1  1  1  1  0  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 76 #######################


> Neighbours evaluated; 24
> Selected Move:	3165	3	5	8	20500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 77 #######################


> Neighbours evaluated; 23
> Selected Move:	3220	3	9	2	18500


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 78 #######################


> Neighbours evaluated; 34
> Selected Move:	3250	3	6	9	19000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 79 #######################


> Neighbours evaluated; 32
> Selected Move:	3250	3	3	5	19000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 80 #######################


> Neighbours evaluated; 33
> Selected Move:	3250	2	5	-1	15000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 81 #######################


> Neighbours evaluated; 30
> Selected Move:	3120	3	8	5	14000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 82 #######################


> Neighbours evaluated; 31
> Selected Move:	3120	1	-1	3	18000


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 83 #######################


> Neighbours evaluated; 31
> Selected Move:	3300	1	-1	6	22000


> New Y[]: 
	
	 2  3  4  1  1  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 84 #######################


> Neighbours evaluated; 22
> Selected Move:	3605	3	3	7	22500


> New Y[]: 
	
	 2  3  4  0  1  1  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 85 #######################


> Neighbours evaluated; 19
> Selected Move:	3603	3	5	8	23500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 86 #######################


> Neighbours evaluated; 19
> Selected Move:	3460	3	8	3	22500


> New Y[]: 
	
	 2  3  4  1  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 87 #######################


> Neighbours evaluated; 16
> Selected Move:	3335	3	7	8	23000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 88 #######################


> Neighbours evaluated; 22
> Selected Move:	3290	3	4	5	21500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 89 #######################


> Neighbours evaluated; 27
> Selected Move:	3185	3	3	4	23000


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 90 #######################


> Neighbours evaluated; 26
> Selected Move:	3140	3	9	7	23000


> New Y[]: 
	
	 2  3  4  0  1  1  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 91 #######################


> Neighbours evaluated; 30
> Selected Move:	3150	3	8	3	22000


> New Y[]: 
	
	 2  3  4  1  1  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 92 #######################


> Neighbours evaluated; 29
> Selected Move:	3110	3	4	8	21500


> New Y[]: 
	
	 2  3  4  1  0  1  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 93 #######################


> Neighbours evaluated; 29
> Selected Move:	3095	3	5	4	23000


> New Y[]: 
	
	 2  3  4  1  1  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 94 #######################


> Neighbours evaluated; 23
> Selected Move:	3110	4	2	4	19600


> New Y[]: 
	
	 2  3  0  1  4  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 95 #######################


> Neighbours evaluated; 26
> Selected Move:	3123	3	6	9	20100


> New Y[]: 
	
	 2  3  0  1  4  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 96 #######################


> Neighbours evaluated; 24
> Selected Move:	3010	3	8	5	19100


> New Y[]: 
	
	 2  3  0  1  4  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 97 #######################


> Neighbours evaluated; 25
> Selected Move:	3200	3	4	2	17000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 98 #######################


> Neighbours evaluated; 26
> Selected Move:	3130	3	0	6	18800


> New Y[]: 
	
	 0  3  4  1  0  1  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 99 #######################


> Neighbours evaluated; 21
> Selected Move:	3192	3	5	4	20300


> New Y[]: 
	
	 0  3  4  1  1  0  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 100 #######################


> Neighbours evaluated; 20
> Selected Move:	3070	3	3	5	20300


> New Y[]: 
	
	 0  3  4  0  1  1  2  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 101 #######################


> Neighbours evaluated; 19
> Selected Move:	3020	3	4	8	19800


> New Y[]: 
	
	 0  3  4  0  0  1  2  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 102 #######################


> Neighbours evaluated; 22
> Selected Move:	3020	4	6	7	19000


> New Y[]: 
	
	 0  3  4  0  0  1  1  2  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 103 #######################


> Neighbours evaluated; 24
> Selected Move:	3130	3	8	3	18000


> New Y[]: 
	
	 0  3  4  1  0  1  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 104 #######################


> Neighbours evaluated; 20
> Selected Move:	3130	4	7	3	18600


> New Y[]: 
	
	 0  3  4  2  0  1  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 105 #######################


> Neighbours evaluated; 19
> Selected Move:	3130	4	3	5	19400


> New Y[]: 
	
	 0  3  4  1  0  2  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 106 #######################


> Neighbours evaluated; 22
> Selected Move:	2959	3	3	4	20900


> New Y[]: 
	
	 0  3  4  0  1  2  1  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 107 #######################


> Neighbours evaluated; 22
> Selected Move:	2946	3	4	8	20400


> New Y[]: 
	
	 0  3  4  0  0  2  1  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 108 #######################


> Neighbours evaluated; 19
> Selected Move:	3020	4	5	8	18700


> New Y[]: 
	
	 0  3  4  0  0  1  1  1  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 109 #######################


> Neighbours evaluated; 22
> Selected Move:	3020	4	8	9	19300


> New Y[]: 
	
	 0  3  4  0  0  1  1  1  1  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 110 #######################


> Neighbours evaluated; 20
> Selected Move:	3124	3	5	4	20800


> New Y[]: 
	
	 0  3  4  0  1  0  1  1  1  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 111 #######################


> Neighbours evaluated; 22
> Selected Move:	3046	4	9	6	21300


> New Y[]: 
	
	 0  3  4  0  1  0  2  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 112 #######################


> Neighbours evaluated; 23
> Selected Move:	3020	2	4	-1	15800


> New Y[]: 
	
	 0  3  4  0  0  0  2  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 113 #######################


> Neighbours evaluated; 24
> Selected Move:	3020	4	6	7	15000


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 114 #######################


> Neighbours evaluated; 24
> Selected Move:	3020	4	7	8	14700


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 115 #######################


> Neighbours evaluated; 22
> Selected Move:	3020	4	8	9	15300


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  1  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 116 #######################


> Neighbours evaluated; 23
> Selected Move:	2960	3	8	4	15800


> New Y[]: 
	
	 0  3  4  0  1  0  1  1  0  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 117 #######################


> Neighbours evaluated; 24
> Selected Move:	2960	4	9	4	15300


> New Y[]: 
	
	 0  3  4  0  2  0  1  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 118 #######################


> Neighbours evaluated; 22
> Selected Move:	2960	4	4	6	16300


> New Y[]: 
	
	 0  3  4  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 119 #######################


> Neighbours evaluated; 21
> Selected Move:	2960	4	6	7	15500


> New Y[]: 
	
	 0  3  4  0  1  0  1  2  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 120 #######################


> Neighbours evaluated; 24
> Selected Move:	2920	3	6	8	16500


> New Y[]: 
	
	 0  3  4  0  1  0  0  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 121 #######################


> Neighbours evaluated; 25
> Selected Move:	3003	1	-1	3	20500


> New Y[]: 
	
	 0  3  4  1  1  0  0  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 122 #######################


> Neighbours evaluated; 25
> Selected Move:	3055	1	-1	6	24500


> New Y[]: 
	
	 0  3  4  1  1  0  1  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 123 #######################


> Neighbours evaluated; 21
> Selected Move:	3109	4	7	8	24200


> New Y[]: 
	
	 0  3  4  1  1  0  1  1  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 124 #######################


> Neighbours evaluated; 22
> Selected Move:	3120	4	8	4	24300


> New Y[]: 
	
	 0  3  4  1  2  0  1  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 125 #######################


> Neighbours evaluated; 23
> Selected Move:	3107	3	8	5	23300


> New Y[]: 
	
	 0  3  4  1  2  1  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 126 #######################


> Neighbours evaluated; 24
> Selected Move:	3070	4	4	7	23500


> New Y[]: 
	
	 0  3  4  1  1  1  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 127 #######################


> Neighbours evaluated; 20
> Selected Move:	3021	4	7	9	23800


> New Y[]: 
	
	 0  3  4  1  1  1  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 128 #######################


> Neighbours evaluated; 19
> Selected Move:	3022	3	5	8	24800


> New Y[]: 
	
	 0  3  4  1  1  0  1  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 129 #######################


> Neighbours evaluated; 18
> Selected Move:	2968	2	6	-1	20800


> New Y[]: 
	
	 0  3  4  1  1  0  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 130 #######################


> Neighbours evaluated; 23
> Selected Move:	3100	3	9	0	19000


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 131 #######################


> Neighbours evaluated; 29
> Selected Move:	3183	1	-1	9	23500


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 132 #######################


> Neighbours evaluated; 18
> Selected Move:	3165	3	3	5	23500


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 133 #######################


> Neighbours evaluated; 28
> Selected Move:	3153	3	8	3	22500


> New Y[]: 
	
	 2  3  4  1  1  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 134 #######################


> Neighbours evaluated; 24
> Selected Move:	3100	3	4	8	22000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 135 #######################


> Neighbours evaluated; 26
> Selected Move:	3010	2	7	-1	17500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 136 #######################


> Neighbours evaluated; 29
> Selected Move:	3020	3	2	6	19800


> New Y[]: 
	
	 2  3  0  1  0  1  4  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 137 #######################


> Neighbours evaluated; 25
> Selected Move:	3059	3	5	4	21300


> New Y[]: 
	
	 2  3  0  1  1  0  4  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 138 #######################


> Neighbours evaluated; 18
> Selected Move:	3196	4	6	8	20400


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 139 #######################


> Neighbours evaluated; 24
> Selected Move:	3112	3	3	7	20900


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  4  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 140 #######################


> Neighbours evaluated; 24
> Selected Move:	3090	4	8	7	21000


> New Y[]: 
	
	 2  3  0  0  1  0  1  4  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 141 #######################


> Neighbours evaluated; 22
> Selected Move:	3085	4	7	9	21000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 142 #######################


> Neighbours evaluated; 22
> Selected Move:	3130	3	8	5	20000


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 143 #######################


> Neighbours evaluated; 23
> Selected Move:	3020	3	4	8	19500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 144 #######################


> Neighbours evaluated; 24
> Selected Move:	3020	4	9	7	19500


> New Y[]: 
	
	 2  3  0  0  0  1  1  4  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 145 #######################


> Neighbours evaluated; 23
> Selected Move:	3020	4	7	8	19400


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  4  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 146 #######################


> Neighbours evaluated; 23
> Selected Move:	3020	3	7	3	18900


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 147 #######################


> Neighbours evaluated; 23
> Selected Move:	3020	4	8	3	19000


> New Y[]: 
	
	 2  3  0  4  0  1  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 148 #######################


> Neighbours evaluated; 22
> Selected Move:	3020	4	3	5	20000


> New Y[]: 
	
	 2  3  0  1  0  4  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 149 #######################


> Neighbours evaluated; 21
> Selected Move:	3033	3	8	4	20500


> New Y[]: 
	
	 2  3  0  1  1  4  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 150 #######################


> Neighbours evaluated; 21
> Selected Move:	2940	3	3	7	21000


> New Y[]: 
	
	 2  3  0  0  1  4  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 151 #######################


> Neighbours evaluated; 20
> Selected Move:	2982	4	5	6	20800


> New Y[]: 
	
	 2  3  0  0  1  1  4  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 152 #######################


> Neighbours evaluated; 22
> Selected Move:	3010	3	6	3	20000


> New Y[]: 
	
	 2  3  0  4  1  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 153 #######################


> Neighbours evaluated; 23
> Selected Move:	3010	4	3	7	20000


> New Y[]: 
	
	 2  3  0  1  1  1  0  4  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 154 #######################


> Neighbours evaluated; 22
> Selected Move:	3010	4	7	9	20000


> New Y[]: 
	
	 2  3  0  1  1  1  0  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 155 #######################


> Neighbours evaluated; 24
> Selected Move:	2975	3	5	8	21000


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  1  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 156 #######################


> Neighbours evaluated; 22
> Selected Move:	2996	4	9	8	20900


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 157 #######################


> Neighbours evaluated; 23
> Selected Move:	3044	3	9	6	20400


> New Y[]: 
	
	 2  3  0  1  1  0  1  1  4  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 158 #######################


> Neighbours evaluated; 24
> Selected Move:	3025	4	8	3	20500


> New Y[]: 
	
	 2  3  0  4  1  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 159 #######################


> Neighbours evaluated; 24
> Selected Move:	3023	4	3	7	20500


> New Y[]: 
	
	 2  3  0  1  1  0  1  4  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 160 #######################


> Neighbours evaluated; 23
> Selected Move:	2980	3	8	5	19500


> New Y[]: 
	
	 2  3  0  1  1  1  1  4  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 161 #######################


> Neighbours evaluated; 25
> Selected Move:	3090	3	7	2	17500


> New Y[]: 
	
	 2  3  4  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 162 #######################


> Neighbours evaluated; 29
> Selected Move:	3100	3	3	8	18500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 163 #######################


> Neighbours evaluated; 30
> Selected Move:	3100	3	6	7	19000


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 164 #######################


> Neighbours evaluated; 30
> Selected Move:	3100	2	5	-1	15000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 165 #######################


> Neighbours evaluated; 31
> Selected Move:	3100	3	7	6	14500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 166 #######################


> Neighbours evaluated; 31
> Selected Move:	2980	3	4	3	13000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 167 #######################


> Neighbours evaluated; 35
> Selected Move:	3060	3	8	9	12500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 168 #######################


> Neighbours evaluated; 31
> Selected Move:	3020	3	2	8	14900


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 169 #######################


> Neighbours evaluated; 25
> Selected Move:	3020	4	8	3	15000


> New Y[]: 
	
	 2  3  0  4  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 170 #######################


> Neighbours evaluated; 23
> Selected Move:	3020	4	3	6	15800


> New Y[]: 
	
	 2  3  0  1  0  0  4  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 171 #######################


> Neighbours evaluated; 23
> Selected Move:	3020	4	6	9	15000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 172 #######################


> Neighbours evaluated; 26
> Selected Move:	3020	3	3	7	15500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 173 #######################


> Neighbours evaluated; 25
> Selected Move:	3020	4	9	6	16300


> New Y[]: 
	
	 2  3  0  0  0  0  4  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 174 #######################


> Neighbours evaluated; 26
> Selected Move:	3020	4	6	7	15500


> New Y[]: 
	
	 2  3  0  0  0  0  1  4  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 175 #######################


> Neighbours evaluated; 23
> Selected Move:	3020	4	7	8	15400


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  4  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 176 #######################


> Neighbours evaluated; 23
> Selected Move:	2960	3	8	4	15100


> New Y[]: 
	
	 2  3  0  0  4  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 177 #######################


> Neighbours evaluated; 25
> Selected Move:	2960	4	4	6	16800


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 178 #######################


> Neighbours evaluated; 25
> Selected Move:	3008	1	-1	8	21800


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 179 #######################


> Neighbours evaluated; 20
> Selected Move:	3005	3	6	3	21000


> New Y[]: 
	
	 2  3  0  4  1  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 180 #######################


> Neighbours evaluated; 21
> Selected Move:	3010	4	3	7	21000


> New Y[]: 
	
	 2  3  0  1  1  0  0  4  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 181 #######################


> Neighbours evaluated; 22
> Selected Move:	3005	1	-1	6	25000


> New Y[]: 
	
	 2  3  0  1  1  0  1  4  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 182 #######################


> Neighbours evaluated; 15
> Selected Move:	3138	4	7	4	24100


> New Y[]: 
	
	 2  3  0  1  4  0  1  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 183 #######################


> Neighbours evaluated; 17
> Selected Move:	3113	3	8	5	23100


> New Y[]: 
	
	 2  3  0  1  4  1  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 184 #######################


> Neighbours evaluated; 18
> Selected Move:	2980	4	4	3	24000


> New Y[]: 
	
	 2  3  0  4  1  1  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 185 #######################


> Neighbours evaluated; 18
> Selected Move:	2980	2	9	-1	19500


> New Y[]: 
	
	 2  3  0  4  1  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 186 #######################


> Neighbours evaluated; 23
> Selected Move:	2980	4	3	4	18600


> New Y[]: 
	
	 2  3  0  1  4  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 187 #######################


> Neighbours evaluated; 22
> Selected Move:	2937	4	4	6	20300


> New Y[]: 
	
	 2  3  0  1  1  1  4  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 188 #######################


> Neighbours evaluated; 24
> Selected Move:	2970	3	6	2	18000


> New Y[]: 
	
	 2  3  4  1  1  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 189 #######################


> Neighbours evaluated; 27
> Selected Move:	2970	2	3	-1	14000


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 190 #######################


> Neighbours evaluated; 30
> Selected Move:	2970	3	7	6	13500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 191 #######################


> Neighbours evaluated; 29
> Selected Move:	2920	3	5	3	13500


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 192 #######################


> Neighbours evaluated; 30
> Selected Move:	2960	3	2	9	15500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 193 #######################


> Neighbours evaluated; 24
> Selected Move:	2960	4	9	3	15500


> New Y[]: 
	
	 2  3  0  4  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 194 #######################


> Neighbours evaluated; 23
> Selected Move:	2960	4	3	4	14600


> New Y[]: 
	
	 2  3  0  1  4  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 195 #######################


> Neighbours evaluated; 22
> Selected Move:	2960	4	4	6	16300


> New Y[]: 
	
	 2  3  0  1  1  0  4  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 196 #######################


> Neighbours evaluated; 24
> Selected Move:	2950	3	4	7	15300


> New Y[]: 
	
	 2  3  0  1  0  0  4  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 197 #######################


> Neighbours evaluated; 23
> Selected Move:	2950	4	6	3	14500


> New Y[]: 
	
	 2  3  0  4  0  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 198 #######################


> Neighbours evaluated; 21
> Selected Move:	2950	4	3	7	14500


> New Y[]: 
	
	 2  3  0  1  0  0  1  4  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 199 #######################


> Neighbours evaluated; 22
> Selected Move:	2960	3	3	4	16000


> New Y[]: 
	
	 2  3  0  0  1  0  1  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 200 #######################


> Neighbours evaluated; 21
> Selected Move:	2960	4	7	9	16000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 201 #######################


> Neighbours evaluated; 23
> Selected Move:	2950	3	4	3	14500


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 202 #######################


> Neighbours evaluated; 23
> Selected Move:	2910	3	9	2	12500


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 203 #######################


> Neighbours evaluated; 28
> Selected Move:	2940	3	6	9	13000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996
________________________________________________________________

Best solution found: 3870
Run Termination time: 03.02.2010 20:23:11
Run duration: 00:00:36.2500000
________________________________________________________________
